Toplogical Data Analysis Detects and Classifies Sunspots (Student Abstract)

Distinguished minimal toplogical lassos

A classical result in distance based tree-reconstruction characterizes when for a distance D on some finite set X there exist a uniquely determined dendrogram on X (essentially a rooted tree T = (V,E) with leaf set X and no degree two vertices but possibly the root and an edge weighting ω : E → R≥0) such that the distance D(T,ω) induced by (T,ω) on X is D. Moreover, algorithms that quickly reco...

Graphs containing toplogical H

Let H denote the tree with six vertices two of which are adjacent and of degree three. Let G be a graph and u1, u2, a1, a2, a3, a4 be distinct vertices of G. We characterize those G that contain a topological H in which u1, u2 are of degree three, and a1, a2, a3, a4 are of degree one. This work was motivated by the Kelmans–Seymour conjecture that 5connected nonplanar graphs contain topological ...

The Power of Sunspots: An Experimental Analysis

The authors show how the influence of extrinsic random signals depends on the noise structure of these signals. They present an experiment on a coordination game in which extrinsic random signals may generate sunspot equilibria. They measure how these signals affect behavior. Sunspot equilibria emerge naturally if there are salient public signals. Highly correlated private signals may also caus...

Student and Postdoctoral Fellow Abstract Approval Form

Visual Progression Analysis of Student Records Data

University curriculum, both on a campus level and on a per-major level, are affected in a complex way by many decisions of many administrators and faculty over time. As universities across the United States share an urgency to significantly improve student success and success retention, there is a pressing need to better understand how the student population is progressing through the curriculu...